#include<bits/stdc++.h>
using namespace std;
#define int long long


bool check(vector<int> a) {
	for (int i = 0; i < 12; i++) {
		if (!a[i] && !a[i + 1])	return false;
	}
	return true;
}


int solution_force() {
	vector<int> a = {0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1};	// 只练习9天
	vector<int> b = {0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1};	// 10
	vector<int> c = {0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1};	// 11
	vector<int> d = {0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1};	// 12

	int ans = 0;
	do {
		if (check(a))	ans++;
	} while (next_permutation(a.begin(), a.end()));

	do {
		if (check(b))	ans++;
	} while (next_permutation(b.begin(), b.end()));

	do {
		if (check(c))	ans++;
	} while (next_permutation(c.begin(), c.end()));

	do {
		if (check(d))	ans++;
	} while (next_permutation(d.begin(), d.end()));

	return ans;
}


int c(int m, int n) {
	int fenzi = 1;
	for (int i = n - m + 1; i <= n; i++)
		fenzi *= i;

	int fenmu = 1;
	for (int i = 1; i <= m; i++)
		fenmu *= i;
	return fenzi / fenmu;
}


int solution_PermutationAndCombination() {
	return c(4, 10) + c(3, 11) + c(2, 12) + c(1, 13);
}


signed main() {
//	system("start https://www.lanqiao.cn/problems/18247/learning/");

	cout << solution_PermutationAndCombination();

	return 0;
}
